Seminar on Algorithms and Geometry – Handout 6 Robert Krauthgamer May 21, 2009 Today’s topics We describe an alternative proof of the Johnson-Lindenstrauss lemma, this time from the perspective of measure concentrati

Source URL: www.wisdom.weizmann.ac.il

• Mathematics
• Real analysis
• Analysis
• Lemmas
• Johnson–Lindenstrauss lemma
• Measure theory

(M, crγ , δ)-MINIMIZING CURVE REGULARITY THOMAS MEINGUET Abstract. We provide a new proof that (M, Cr γ , δ)-minimizing sets (0 < γ  1) are pieces of C 1,γ/2 curves. 1. Introduction

Source URL: www.uclouvain.be

• Spectral theory of ordinary differential equations
• Symbol
• Mathematics
• Uniform space
• Function

June 22, 2009 — Final version for the proceedings of CSL’09 Expanding the realm of systematic proof theory Agata Ciabattoni1 , Lutz Straßburger2 , and Kazushige Terui3 1

Source URL: www.lix.polytechnique.fr

• Mathematics
• Sequent calculus
• Intuitionistic logic
• Cut-elimination theorem
• Interpretation
• Sequent
• Structural rule
• Propositional calculus
• Linear logic
• Logic
• Mathematical logic
• Proof theory

Revised 11 Manuscript 10 February 2009

Source URL: www.tunl.duke.edu

• Nuclear reaction
• Electronvolt
• Valuation
• Proof theory

Towards Proof Planning for M+ ω Carsten Sch¨ urmann Yale University

Source URL: www.itu.dk

• Deduction
• Logic
• Natural deduction
• Logic in computer science
• Lambda calculus
• Combinatory logic
• Mathematical logic
• Theoretical computer science
• Proof theory

QUASIPOLYNOMIAL NORMALISATION IN DEEP INFERENCE VIA ATOMIC FLOWS AND THRESHOLD FORMULAE PAOLA BRUSCOLI, ALESSIO GUGLIELMI, TOM GUNDERSEN, AND MICHEL PARIGOT ABSTRACT. Jeˇrábek showed that cuts in propositional-logic de

Source URL: www.cs.bath.ac.uk

• Natural deduction
• Sequent calculus
• Rule of inference
• Deep inference
• Sequent
• Cut-elimination theorem
• Substitution
• Propositional calculus
• Proof calculus
• Logic
• Proof theory
• Mathematical logic

2008 Paper 5 Question 10 Computation Theory (a) The Halting Problem for register machines is unsolvable. State, without proof, a precise form of this result. [3 marks]

Source URL: www.cl.cam.ac.uk

A Machine-Checked Formalization of Sigma-Protocols Gilles Barthe, Daniel Hedin, Santiago Zanella B´eguelin IMDEA Software, Madrid, Spain {Gilles.Barthe, Daniel.Hedin, Santiago.Zanella}@imdea.org Abstract—Zero-knowled

Source URL: certicrypt.gforge.inria.fr

• Mathematical logic
• Model theory
• Proof of knowledge
• Functions and mappings
• IP
• Zero-knowledge proof
• Structure
• Functor
• Soundness
• Mathematics
• Cryptographic protocols
• Logic

Editorial: Special issue on non-classical mathematics The 20th century witnessed not only incredible advances in the model theory and proof theory of classical logic, but also a corresponding advance of non-classical (or

Source URL: consequently.org

• Paraconsistent logic
• Intuitionism
• Intuitionistic logic
• Classical logic
• Many-valued logic
• Fuzzy logic
• Proof theory
• Modal logic
• Truth value
• Logic
• Mathematical logic
• Non-classical logic

Additive Number Theory ExercisesWithout giving full details, explain why in the first proof of the Hales-Jewett theorem it is in fact enough to find y1 , . . . , yr and A1 , . . . , Ar with the following property:

Source URL: www.dpmms.cam.ac.uk